Another well-solvable case of the QAP: Maximizing the job completion time variance
نویسندگان
چکیده
We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the other matrix has a multi-layered structure that is built on top of certain Toeplitz matrices. As an application of our main result, we derive a (simple and concise) alternative proof for a recent result on the scheduling problem of maximizing the variance of job completion times.
منابع مشابه
Well-solvable cases of the QAP with block-structured matrices
We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple block structure. For the special case where the second underlying matrix is a monotone anti-Monge matrix, we derive a polynomial time result for a certain class of cut problems. For the special case where the second underlying matrix is a product matrix, we identify t...
متن کاملNew Results on the Completion Time Variance Minimization
A single machine scheduling problem where the objective is to minimize the variance of job completion times is considered. The model is applicable to many environments where it is desirable to provide jobs, customers or computer files, with approximately the same service. It is shown that the problem can be formulated as a problem of maximizing a zeroone quadratic function which is a submodular...
متن کاملLinearizable special cases of the QAP
We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.
متن کاملProject Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources
Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...
متن کاملSome scheduling problems with sum-of-processing-times-based and job-position-based learning effects
In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012